Error resilient arithmetic coding of still images
نویسندگان
چکیده
This paper examines the use of arithmetic coding in conjunction with the error resilient entropy code (EREC). The constraints on the coding model are discussed and simulation results are presented and compared to those obtained using Huffman coding. These results show that without the EREC, arithmetic coding is less resilient than Huffman coding, while with the EREC both systems yield comparable results.
منابع مشابه
Error Resilient Image Transmission Over a Bluetooth Network
This paper proposes the use of an Error-Resilient Entropy Coding (EREC) scheme for the transmission of JPEG images across a Bluetooth wireless network. Bluetooth, being an ad-hoc networking standard, can be used in multiple environments, often under difficult conditions, leading to limited bandwidth and significant Bit Error Rates (BER). Compression and transmission provisions, that avoid catas...
متن کاملBandwidth Efficient and Error Resilient Image Coding for Rayleigh Fading Channels
The transmission of still images over wireless channels is an exercise in tradeoos. For bandwidth eeciency, a high source compression rate is required. However, the transmission must be robust towards channel errors since wireless channels are subject to fading. These are connicting requirements. High source compression rates result in images that are very vulnerable to any single bit error. Lo...
متن کاملImage transmission using error-resilient wavelet coding and forward error correction
An error-resilient coding scheme is proposed for the transmission of images over unreliable channels. Forward Error Correction is used in conjunction with the error-resilient source coder for the protection of the compressed stream. Unlike almost all other robust coding schemes presented todate, the proposed scheme is able to decode portions of the bitstream even after the occurrence of uncorre...
متن کاملSoft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes
The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source. The approximation of the source distribution leads to the introduction of redundancy that can be exploited for robust decoding in presence of ...
متن کاملAn Error-Resilient Blocksorting Compression Algorithm
A Burrows-Wheeler Compressor breaks input into blocks, quickly makes each more compressible, and compresses the modified block with a simple arithmetic or Huffman compressor. We propose an error-resilient Inverse Burrows-Wheeler Compressor. It uses a small amount of overhead alongside output from an ordinary BWT and MTF. It is also size-competitive with BZIP, a popular Burrows-Wheeler compressor.
متن کامل